Proving entailment between conceptual state specifications
نویسندگان
چکیده
منابع مشابه
Proving Entailment Between Conceptual State Specifications
The lack of expressive power of temporal logic as a speciication language can be compensated to a certain extent by the introduction of powerful, high-level temporal operators, which are diicult to understand and reason about. A more natural way to increase the expressive power of a temporal speciication language is by introducing conceptual state variables, which are auxiliary (unimplemented) ...
متن کاملProving Entailment between Conceptual State Speciications
The lack of expressive power of temporal logic as a speciication language can be compensated to a certain extent by the introduction of powerful, high-level temporal operators, which are diicult to understand and reason about. A more natural way to increase the expressive power of a temporal speciication language is by introducing conceptual state variables, which are auxiliary (unimplemented) ...
متن کاملFormalizing and Proving Semantic Relations between Specifications by Reflection
This work contains both a theoretical development and a novel application of ideas introduced in [1] for using reflection in formal metareasoning. From the theoretical side, we extend the metareasoning principles proposed in [1] to cover the case of metatheorems about equational theories which are unrelated by the inclusion relation. From the practical side, we apply the newly introduced metare...
متن کاملTextual Entailment Recognizing by Theorem Proving Approach
In this paper we present two original methods for recognizing textual inference.First one is a modified resolution method such that some linguistic considerations are introduced in the unification of two atoms. The approach is possible due to the recent methods of transforming texts in logic formulas. Second one is based on semantic relations in text, as presented in WordNet. Some similarities ...
متن کاملRecognizing Textual Entailment by Theorem Proving Approach
We present two original methods for recognizing textual inference. First, is a modified resolution method, used in theorem proving, such that some linguistic considerations are introduced in unification of two atoms. Some recent methods of transforming texts in logic forms are used. Second, is based on semantic relations in text, as presented in WordNet. Both methods provide comparable results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90007-1